Search results for "discrete [space-time]"
showing 10 items of 2035 documents
Prime Rings Whose Units Satisfy a Group Identity. II
2003
Abstract Let R be a prime ring and 𝒰(R) its group of units. We prove that if 𝒰(R) satisfies a group identity and 𝒰(R) generates R,then either R is a domain or R is isomorphic to the algebra of n × n matrices over a finite field of order d. Moreover the integers n and d depend only on the group identity satisfed by 𝒰(R). This result has been recently proved by C. H. Liu and T. K. Lee (Liu,C. H.; Lee,T. K. Group identities and prime rings generated by units. Comm. Algebra (to appear)) and here we present a new different proof.
Analysis of Optimal High Resolution and Fixed Rate Scalar Quantization
2009
In 2001, Hui and Neuhoff proposed a uniform quantizer with overload for the quantization of scalar signals and derived the asymptotically optimal size of the quantization bins in the high-bitrate limit. The purpose of the present paper is to prove a quantitatively more precise version of this result which, at the same time, is valid for a more general, quite natural class of probability distributions that requires only little regularity and includes, for instance, positive Lipschitz-continuous functions of unit integral.
Divisible designs from semifield planes
2002
AbstractWe give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.
Algorithmic Information Theory and Computational Complexity
2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially. The second example refers to frequency computation. Frequency computation was introduced by Rose and McNaughton in early sixties and developed by Trakhtenbrot, Kinber, Degtev, Wechsung, Hinrichs and others. A transducer is a finite-state automaton with an input and an output. We consider the possibilities of probabilistic and frequency transducers and prove sever…
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
A note on the Banach space of preregular maps
2011
The aim of this paper is to give simple proofs for Jeurnink's characterizations of preregular maps in terms of Θ-maps acting between Banach lattices. For Banach lattices E and F, we achieve our goal by considering the space Lβ(E, F) of all those linear maps T: E → F for which there exists a constant K such that {double pipe}Vn i=1 {pipe}Txi{pipe} ≤ K {double pipe}Vn i=1{pipe}xi for all finite sequences x1, ..., xn e{open}E. We show that, if Lβ(E; F), and the spaces L Θ (E; F) of Θ -map and Lpr(E; F) of preregular maps are respectively endowed with their canonical norms, then they are identical Banach spaces
An integral for a banach valued function
2009
Abstract Using partitions of the unity ((PU)-partition), a new definition of an integral is given for a function f : [a, b] → X, where X is a Banach space, and it is proved that this integral is equivalent to the Bochner integral.
On a linear diophantine problem of Frobenius
1993
Abstract In this paper, linear diophantine problem of Frobenius is discussed. A theorem concerning the largest integer g m (a1,a2) and the smallest integer G m (a1,a2) with m different representations with a1,a2 as basis is proved.
On certain extension theorems in the mixed Borel setting
2004
Abstract Given two sequences M 1 and M 2 of positive numbers, we give necessary and sufficient conditions under which the inclusions Λ { M 1 } ⊂ f (j) (0) j∈ N 0 : f∈ D { M 2 } [−1,1] , Λ ( M 1 ) ⊂ f (j) (0) j∈ N 0 : f∈ D ( M 2 ) [−1,1] hold, by means of explicit constructions. This answers a question raised by Chaumat and Chollet (Math. Ann. 298 (1994) 7–40). We also consider the case when [−1,1] is replaced by [−1,1]m as well as the possibility to get ultraholomorphic extensions.
On the listing and random generation of hybrid binary trees
1994
We consider in this paper binary trees whose internal nodes are either associative or non-associative. Hybrid binary trees are equivalence classes with respect to the associative property. We count, list and generate randomly hybrid binary trees using Fibonacci numbers.